sparse graph造句

Adjacency lists are generally preferred because they efficiently represent sparse graphs.
List structures are often preferred for sparse graphs as they have smaller memory requirements.
For sparse graphs, tighter bounds are possible.
Research in this area has focused on finding sparse graphs for a given point set that have low stretch factor.
The state of the art classical error-correcting codes are based on sparse graphs, achieving close to the Shannon limit.
It's difficult to find sparse graph in a sentence. 用sparse graph造句挺难的

In graph theory, Laman graphs are a family of sparse graphs describing minimally rigid systems of rods and joints in the plane.
There are also recent extensions to the sparse graph regime, from both the perspective of random graph models and graph limit theory.
In particular, there are generalizations of graphons to the sparse graph regime that could just as well be called continuous graphs .
Interval graphs and chordal graphs also have at most " n " maximal cliques, even though they are not always sparse graphs.
The time per maximal independent set is proportional to that for matrix multiplication in dense graphs, or faster in various classes of sparse graphs.
In graph theory, isoperimetric inequalities are at the heart of the study of expander graphs, which are sparse graphs that have strong connectivity properties.
However, for interval graphs, a constant competitive ratio is possible, while for bipartite graphs and sparse graphs a logarithmic ratio can be achieved.
However, for a sparse graph, adjacency lists require less space, because they do not waste any space to represent edges that are not present.
The ErdQs Burr conjecture, published as a conjecture by ErdQs and Burr in 1975 and still unsolved, states that sparse graphs have linearly growing Ramsey numbers.
These are the graphs in which all shallow minors are sparse graphs, with a ratio of edges to vertices bounded by a function of the depth of the minor.

更多例句：下一页